Reconstruction of discrete sets from two or more X-rays in any direction
نویسندگان
چکیده
During the workshop entitled “Discrete Tomography”, held in Volkrange on March 22, 1999, A. Kuba presented the open problem of reconstructing discrete sets satisfying the properties of connectivity and convexity by projections taken along many directions. In this paper, we study this problem, considering a similar property of discrete sets: the Q-convexity. In fact this property contains a certain kind of connectivity and convexity. The main result of this paper is a polynomial-time algorithm which is able to reconstruct Q-convex sets from their projections, when the directions of the projections and the ones of the Q-convexity are the same. Moreover, the algorithm works for any finite number of directions. keywords: algorithms, combinatorial problems, convexity, discrete tomography, discrete sets.
منابع مشابه
On the Stability of Reconstructing Lattice Sets from X-rays Along Two Directions
We consider the stability problem of reconstructing lattice sets from their noisy X-rays (i.e. line sums) taken along two directions. Stability is of major importance in discrete tomography because, in practice, these X-rays are affected by errors due to the nature of measurements. It has been shown that the reconstruction from noisy X-rays taken along more than two directions can lead to drama...
متن کاملApproximate X-rays reconstruction of special lattice sets
Sometimes the inaccuracy of the measurements of the X-rays can give rise to an inconsistent reconstruction problem. In this paper we address the problem of reconstructing special lattice sets in Z from their approximate X-rays in a finite number of prescribed lattice directions. The class of “strongly Q-convex sets” is taken into consideration and a polynomial time algorithm for reconstructing ...
متن کاملDetermination of Q-convex sets by X-rays
In this paper, the problem of the determination of lattice sets from X-rays is studied. We define the class of Q-convex sets along a set D of directions which generalizes classical lattice convexity and we prove that for any D, the X-rays along D determine all the convex sets if and only if it determines all the Q-convex sets along D. As a consequence, any algorithm which reconstructs Q-convex ...
متن کاملReconstruction of Discrete Sets from Two or More Projections in Any Direction
During the workshop entitled “Discrete Tomography”, held in Volkrange on March 22, 1999, A. Kuba presented the open problem of reconstructing discrete sets satisfying the properties of connectivity and convexity by projections taken along many directions. In this paper, we study this problem, considering a similar property of discrete sets: the Q-convexity. In fact this property contains a cert...
متن کاملReconstruction of lattice sets from infinite X-rays
For any infinite non-null vectors there is always a subset of Z2 whose X-rays along fixed directions are the given vectors. If there are only two directions and the vectors are periodic, then the set can be chosen periodic, it’s not true with more than two directions.
متن کامل